Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms

نویسندگان

  • Constantin Orasan
  • Richard Evans
  • Ruslan Mitkov
چکیده

The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MARS-a program for automatic resolution of pronominal anaphors and describes an experiment which we have conducted to optimise the success rate of MARS with the help of a genetic algorithm. After the optimisation we noted an improvement up to 8% for some les. The results obtained after optimisation are discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anaphora Resolution in Multi-Person Dialogues

Anaphora resolution for dialogues is a difficult problem because of the several kinds of complex anaphoric references generally present in dialogic discourses. It is nevertheless a critical first step in the processing of any such discourse. In this paper, we describe a system for anaphora resolution in multi-person dialogues. This system aims to bring together a wide array syntactic, semantic ...

متن کامل

Corpus-Based Anaphora Resolution Towards Antecedent Preference

In this paper we propose a corpus-based approach to anaphora resolution combining a machine learning method and statistical information. First, a decision tree trained on an annotated corpus determines the coreference relation of a given anaphor and antecedent candidates and is utilized as a lter in order to reduce the number of potential candidates. In the second step, preference selection is ...

متن کامل

Anaphora resolution and minimal models

Some anaphora resolution algorithms are based on model builders, and use the fact that they generate minimal models: only those elements that are necessary are postulated to exist in the model. In this way, such systems have the desirable property that if anaphora can be resolved to a linguistically available antecedent, this resolution applies, and only if there is no suitable antecedent, a de...

متن کامل

Towards a more Consistent and Comprehensive Evaluation of Anaphora Resolution Algorithms and Systems

The paper argues that evaluation of anaphora resolution algorithms and anaphora resolution systems should be carried out separately and shows that recall and precision are imperfect as measures for anaphora resolution algorithms. The paper proposes a package of evaluation measures and tasks for anaphora resolution which provide a clearer, more comprehensive picture of the performance of both an...

متن کامل

Multi-metric optimization for coreference: The UniTN / IITP / Essex submission to the 2011 CONLL Shared Task

Because there is no generally accepted metric for measuring the performance of anaphora resolution systems, a combination of metrics was proposed to evaluate submissions to the 2011 CONLL Shared Task (Pradhan et al., 2011). We investigate therefore Multiobjective function Optimization (MOO) techniques based on Genetic Algorithms to optimize models according to multiple metrics simultaneously.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000